PROFESSOR BROOKS ON CONSCIOUSNESS AND VOLITION
نویسندگان
چکیده
منابع مشابه
Volition and Physical Laws
The term "known laws of physics" is meant to include any of the theoretical machinery used in unified field theory and string theory, even though these subjects are in an unfinished state. This theoretical machinery uses the same basic concepts-space, time, mass, interaction strength-as the present body of physics and does not make any assertions about consciousness. The concept of free will is...
متن کاملAn Improvement on Brooks’ Theorem
We prove that χ(G) ≤ max { ω(G),∆2(G), 5 6 (∆(G) + 1) } for every graph G with ∆(G) ≥ 3. Here ∆2 is the parameter introduced by Stacho that gives the largest degree that a vertex v can have subject to the condition that v is adjacent to a vertex whose degree is at least as large as its own. This upper bound generalizes both Brooks’ Theorem and the Ore-degree version of Brooks’ Theorem.
متن کاملBrooks' Theorem and Beyond
We collect some of our favorite proofs of Brooks’ Theorem, highlighting advantages and extensions of each. The proofs illustrate some of the major techniques in graph coloring, such as greedy coloring, Kempe chains, hitting sets, and the Kernel Lemma. We also discuss standard strengthenings of vertex coloring, such as list coloring, online list coloring, and Alon–Tarsi orientations, since analo...
متن کاملVolition and imagery in neurorehabilitation.
New interventional approaches have been proposed in the last few years to treat the motor deficits resulting from brain lesions. Training protocols represent the gold-standard of these approaches. However, the degree of motor recovery experienced by most patients remains incomplete. It would be important to improve our understanding of the mechanisms underlying functional recovery. This chapter...
متن کاملOn Brooks' Theorem for Sparse Graphs
Let G be a graph with maximum degree ∆(G). In this paper we prove that if the girth g(G) of G is greater than 4 then its chromatic number, χ(G), satisfies χ(G) ≤ (1 + o(1)) ∆(G) log ∆(G) where o(1) goes to zero as ∆(G) goes to infinity. (Our logarithms are base e.) More generally, we prove the same bound for the list-chromatic (or choice) number: χ l (G) ≤ (1 + o(1)) ∆(G) log ∆(G) provided g(G)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science
سال: 1895
ISSN: 0036-8075,1095-9203
DOI: 10.1126/science.2.42.521